CONSTRAINTS ON AN ENHANCED s̄dZ VERTEX FROM ε′/ε1
نویسنده
چکیده
We analyze rare kaon decays in models in which the dominant new effect is an enhanced s̄dZ vertex Zds. We point out that in spite of large theoretical uncertainties the CP-violating ratio ε /ε provides at present the strongest constraint on ImZds. Assuming 1.5 · 10−3 ≤ ε/ε ≤ 3 · 10−3 and Standard Model values for the CKM parameters we obtain the bounds BR(KL → π0νν̄) ≤ 3.9 · 10−10 and BR(KL → πee)dir ≤ 7.9 · 10−11. Using the bound on ReZds from KL → μ+μ− we find BR(K+ → π+νν̄) ≤ 2.6 · 10−10. We also discuss new physics scenarios in which in addition to an enhanced s̄dZ vertex also neutral meson mixing receives important new contributions. In this case our most conservative bounds are BR(KL → π0νν̄) ≤ 1.8 · 10−9, BR(KL → πee)dir ≤ 2.8 · 10−10 and BR(K+ → π+νν̄) ≤ 6.1 · 10−10. The dependence of the upper bound for BR(KL → π0νν̄) on the CKM parameters is also analyzed. Talk given at the XXXIVnd Rencontres de Moriond “ELECTROWEAK INTERACTIONS AND UNIFIED THEORIES”, Les Arcs, France, 13-20 March 1999.
منابع مشابه
Solving Packing Problem with Weaker Block Solvers
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block solver ABS(p, ε/6, c) with price vector p, given accuracy ε and ratio c is required. In addition, in [Villavicencio and Grigoriadis, Network Optimization (1997)] a (1 + ε)approximation algorithm for standard packing pro...
متن کاملCP violation in supersymmetric models with Hermitian Yukawa couplings and A-terms
We analyse the CP violation in supersymmetric models with Hermitian Yukawa and trilinear couplings. We show that Hermitian Yukawa matrices can be implemented in supersymmetric models with SU(3) flavor symmetry. An important feature of this class of models is that the supersymmetric contributions to the EDM of the neutron and mercury atom are suppressed. In this framework, εK can be saturated by...
متن کاملNote on MAX 2SAT
In this note we present an approximation algorithm for MAX 2SAT that given a (1− ε) satisfiable instance finds an assignment of variables satisfying a 1−O( √ ε) fraction of all constraints. This result is optimal assuming the Unique Games Conjecture. The best previously known result, due to Zwick, was 1−O(ε1/3). We believe that the analysis of our algorithm is much simpler than the analysis of ...
متن کاملOn vertex balance index set of some graphs
Let Z2 = {0, 1} and G = (V ,E) be a graph. A labeling f : V → Z2 induces an edge labeling f* : E →Z2 defined by f*(uv) = f(u).f (v). For i ε Z2 let vf (i) = v(i) = card{v ε V : f(v) = i} and ef (i) = e(i) = {e ε E : f*(e) = i}. A labeling f is said to be Vertex-friendly if | v(0) − v(1) |≤ 1. The vertex balance index set is defined by {| ef (0) − ef (1) | : f is vertex-friendly}. In this paper ...
متن کاملOpacity Build-up in Impulsive Relativistic Sources
Opacity effects in relativistic sources of high-energy gamma-rays, such as gamma-ray bursts (GRBs) or Blazars, can probe the Lorentz factor of the outflow as well as the distance of the emission site from the source, and thus help constrain the composition of the outflow (protons, pairs, magnetic field) and the emission mechanism. Most previous works consider the opacity in steady state. Here w...
متن کامل